Surface Optimal Path Planning Using an Extended Dijkstra Algorithm
نویسندگان
چکیده
منابع مشابه
An Improved Dijkstra Shortest Path Algorithm
An improved Dijkstra shortest path algorithm is presented in this paper. The improved algorithm introduces a constraint function with weighted value to solve the defects of the data structure storage, such as lots of redundancy of space and time. The number of search nodes is reduced by ignoring reversed nodes and the weighted value is flexibly changed to adapt to different network complexity. ...
متن کاملAn Adaptive Distributed Dijkstra Shortest Path Algorithm
We give a distributed algorithm to compute shortest paths in a network with changing topology. It does not suffer from the routing table looping behavior associated with the Ford-Bellman tdistributed shortest path algorithm although it uses truly distributed processing. Its time and message complexities are evaluated. Pierre Humblet is with the Laboratory for Information and Decision Systems, M...
متن کاملDijkstra ’ s Shortest Path Algorithm
The underlying principle of the algorithm may be described as follows: the algorithm starts with the source; it visits the vertices in order of increasing cost, and maintains a set V of visited vertices (denoted by UsedVx in the article) whose cost from the source has been computed, and a tentative cost D(u) to each unvisited vertex u. In the article, the set of all unvisited vertices is denote...
متن کاملDijkstra Shortest Path Algorithm using Global Positioning System
Dijkstra’s Algorithm is used to find the shortest path from one node to another node in a graph.Dijkstra’s algorithm is also known as a single source shortest path algorithm. It is applied only on positive weights. In this paper, Global Positioning System is used for adding a new functionality in Dijkstra’s algorithm. In this paper, using Global Positioning System the position parameter is adde...
متن کاملA Multiple Mobile Robots Path planning Algorithm Based on A-star and Dijkstra Algorithm
Path planning algorithm is a key issue among robot control areas. In practical engineering applications, traditional methods have some limitations to a certain degrees in key aspects of cost, efficiency, security, flexibility, portability, etc. Through the analysis and comparison of A-star algorithm and Dijkstra algorithm, path planning problem supporting multiple cars run parallely (PPSMC for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.3015976